Lattices of homomorphisms
نویسندگان
چکیده
منابع مشابه
Construction of Homomorphisms of ^-continuous Lattices
We present a direct approach to constructing homomorphisms of A/-continuous lattices, a generalization of continuous lattices, into the unit interval, and show that an M -continuous lattice has sufficiently many homomorphisms into the unit interval to separate the points. In the past twenty years the concept of a continuous lattice and its generalizations have attracted more and more attention....
متن کاملIdeal of Lattice homomorphisms corresponding to the products of two arbitrary lattices and the lattice [2]
Abstract. Let L and M be two finite lattices. The ideal J(L,M) is a monomial ideal in a specific polynomial ring and whose minimal monomial generators correspond to lattice homomorphisms ϕ: L→M. This ideal is called the ideal of lattice homomorphism. In this paper, we study J(L,M) in the case that L is the product of two lattices L_1 and L_2 and M is the chain [2]. We first characterize the set...
متن کاملRepresenting Homomorphisms of Congruence Lattices as Restrictions of Congruences of Isoform Lattices
Let L1 be a finite lattice with an ideal L2. Then the restriction map is a {0, 1}-homomorphism from ConL1 into ConL2. In 1986, the present authors published the converse. If D1 and D2 are finite distributive lattices, and φ : D1 → D2 is a {0, 1}-homomorphism, then there are finite lattices L1 and L2 with an embedding η of L2 as an ideal of L1, and there are isomorphisms ε1 : ConL1 → D1 and ε2 :...
متن کاملRepresentations of Join-homomorphisms of Distributive Lattices with Doubly 2-distributive Lattices
In the early eighties, A. Huhn proved that if D, E are finite distributive lattices and ψ : D → E is a {0}-preserving join-embedding, then there are finite lattices K, L and there is a lattice homomorphism φ : K → L such that ConK (the congruence lattice of K) is isomorphic to D, ConL (the congruence lattice of L) is isomorphic to E, and the natural induced mapping extφ : ConK → ConL represents...
متن کاملCounting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices
We present a framework for the complexity classification of parameterized counting problems that can be formulated as the summation over the numbers of homomorphisms from small pattern graphs H1, . . . ,H` to a big host graph G with the restriction that the coefficients correspond to evaluations of the Möbius function over the lattice of a graphic matroid. This generalizes the idea of Curticape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
سال: 1986
ISSN: 0263-6115
DOI: 10.1017/s1446788700027567